XML-based representation of mobile process calculi

ABSTRACT

A methodology is provided for encoding mobile process calculi in XML. Mobile process calculi (e.g., Π-calculus, Join Calculus, Blue Calculus) are often employed in modeling business processes. The present method provides for encoding a mobile process algebra in XML by providing a mobile process algebra, reducing the process algebra to infix notation, transforming the mobile process algebra from infix notation to prefix notation, and then transforming the prefix notation to a set of tags via structural induction. Annotating tags can then be provided around the basic process algebra constructors. The set of tags represent an XML schema. The XML schema can then be reduced to a programming language. An example of reducing a specific algebra (combinators—a derivative of Π-calculus) to an XML schema is provided. The XML schema is reduced to a programming language ideal for business workflow processes.

CROSS REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. patent application Ser. No. 09/560,223 filed on Apr. 28, 2000 now U.S. Pat. No. 6,516,322 and entitled XML-BASED REPRESENTATION OF MOBILE PROCESS CALCULI, the entirety of which is incorporated herein by reference.

TECHNICAL FIELD

The present invention relates to computer systems, and more particularly to a method for representing distributed and parallel computing systems based on process algebra and reducing the process algebra to a useful programming language for use in real world applications.

BACKGROUND OF THE INVENTION

Transaction processing systems have led the way for many ideas in distributed computing and fault-tolerant computing. For example, transaction processing systems have introduced distributed data for reliability, availability, and performance, and fault tolerant storage and processes, in addition to contributing to the client-server model and remote procedure call for distributed computation. Importantly, transaction processing introduced the concept of transaction ACID properties—atomicity, consistency, isolation and durability that has emerged as the unifying concept for distributed computations. Atomicity refers to a transaction's change to the state of the overall system happening all at once or not at all. Consistency refers to a transaction being a correct transformation of the system state and essentially means that the transaction is a correct program. Although transactions execute concurrently, isolation ensures that transactions appear to execute before or after another transaction because intermediate states of transactions are not visible to other transactions (e.g., locked during execution). Durability refers to once a transaction completes successfully (commits) its activities or its changes to the state become permanent and survive failures.

Many applications for workflow tools are internal to a business or organization. With the advent of networked computers and modems, computer systems at remote locations can now easily communicate with one another. This allows computer system workflow applications to be used between remote facilities within a company. Workflow applications can also be of particular utility in processing business transactions between different companies. Automating such processes can result in significant efficiency improvements, not otherwise possible. However, this inter-company application of workflow technology requires co-operation of the companies and proper interfacing of the individual company's existing computer systems.

Many attempts at description languages for business workflow process have been made. These languages target specifications of distributed and concurrent systems for the purpose of systems integration. The extensible markup language (XML) has been designed for system integration. XML is a meta-markup language that provides a format for describing structured data. An XML element can declare its associated data to be a retail price, a sales tax, a book title, or any desired data element. XML provides a structural representation of data that has proved broadly implementable and easy to deploy. A piece of information marked by the presence of tags is called an element. Elements can be further described by attaching name value pairs called attributes. Once the data is received by the client, the data can be manipulated edited and presented in multiple ways without being sent back to the server. The XML syntax uses matching start and end tags to mark up information. Presently, XML has been applied to the representations of applications data (e.g., business documents, EDI messages). Efforts have been made by the Workflow Management Consortium to describe business processes with XML. However, none of these descriptions have provided a compelling and theoretically sound framework for description of system behavior.

Accordingly, there is a strong need in the art for a method for providing a sound framework for business workflow process applications in addition to providing a sound framework in the broad domain of distributed and parallel computing.

SUMMARY OF THE INVENTION

The present invention relates to a methodology for encoding mobile process calculi into XML. Mobile process calculi (e.g., Π-calculus, Join Calculus, Blue Calculus) are ideally suited for modeling a wide variety of processes, including business processes. The present invention provides for encoding the grammar of a mobile process algebra as an XML schema. The invention takes a representation of the grammar of a mobile process algebra, for example an EBNF specification, and reformulates the process algebra syntax to infix notation, and then transforming the prefix notation to a set of tags via structural induction. Annotating tags can then be provided around basic process algebra constructors. For example, tags introducing other semantic constraints, e.g. transaction boundaries or continuations may be introduced with minimal impact on the basic structure of the process algebra representation. As mentioned, the set of tags represent an XML schema. If the process algebra has an executable semantics, then the XML schema can then be provided as a textual and machine-readable format of a programming language. An example of reducing a specific algebra (combinators—a derivative of Π-calculus) to an XML schema is provided below. The XML schema is reduced to a programming language ideal for business workflow processes. An example of a business process employing the programming language is also provided herein.

The present invention also includes a new process algebra that is tailored to support domains of processes, like business processes, that have requirements for concurrent join and transaction semantics. The new process algebra considered in the present invention is unique in that it not only provides expression for sequencing, branching and parallelism, but also distinguishes isolated parallelism and communicating parallelism, provides types of concurrency and provides a polymorphic specification as an effective procedure for testing message equality. Furthermore, the present invention affords the ability to separate dataflow from control flow, thus allowing encoding of the process algebra to focus on expression of control flow constraints.

In one aspect of the invention, a method of producing a schema for a domain of process algebra is provided. The method comprises the steps of transforming the process algebra from infix notation to prefix notation and transforming the prefix notation to a set of tags, wherein the set of tags represent a schema.

In another aspect of the invention a method is provided of producing an XML schema for a domain of process algebra. The method comprises the steps of transforming the process algebra from infix notation to prefix notation and transforming the prefix notation to a set of XML tags via structural induction, wherein the set of tags represent a schema.

In yet another aspect of the invention an XML schema is provided. The XML schema comprises a first element representing a construct for distinguishing between synchronization of autonomous concurrent operations from interdependent concurrent operations and a second element representing a construct for interdependent operations.

In another aspect of the invention, a software module is provided. The software module comprises a receiving component adapted to receive a specification of the grammar of a process algebra, for example a specification in EBNF, a construct component adapted to provide a construct for each operator in the process algebra and an output component adapted to output the constructs corresponding to the process algebra operators.

In an alternate aspect of the invention a system is provided for providing a schema from a process algebra. The system comprises means for inputting a process algebra, means for providing a plurality of constructs corresponding to operators in the process algebra and means for outputting the plurality of constructs.

In one aspect of the invention, a system for producing a schema for a domain of process algebra is provided. The system comprises a subsystem for transforming the process algebra from infix notation to prefix notation and a subsystem for transforming the prefix notation to a set of tags, wherein the set of tags represent a schema.

In another aspect of the invention, a system for producing a schema for a domain of process algebra is provided. The system comprises means for transforming the process algebra from infix notation to prefix notation and means for transforming the prefix notation to a set of tags, wherein the set of tags represent a schema.

To the accomplishment of the foregoing and related ends, the invention then, comprises the features hereinafter fully described and particularly pointed out in the claims. The following description and the annexed drawings set forth in detail certain illustrative embodiments of the invention. These embodiments are indicative, however, of but a few of the various ways in which the principles of the invention may be employed and the present invention is intended to include all such embodiments and their equivalents. Other objects, advantages and novel features of the invention will become apparent from the following detailed description of the invention when considered in conjunction with the drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 a is a flow chart illustrating reducing a process algebra to an XML schema in accordance with one aspect of the present invention.

FIG. 1 b illustrates a particular process algebra suited for business workflow processes in accordance with one aspect of the present invention.

FIG. 1 c illustrates a block diagram of a business workflow model in accordance with one aspect of the present invention.

FIG. 1 d is a flow chart illustrating a compensation routine in accordance with one aspect of the present invention.

FIG. 2 a illustrates a block diagram of a computer system in accordance with an environment of the present invention.

FIG. 2 b illustrates a diagrammatic view of a system for modeling a business workflow process in accordance with an alternate environment of the present invention.

FIG. 3 illustrates a UML interaction diagram of a simplified purchase interaction in accordance with one aspect of the present invention.

FIGS. 4 a-4 d illustrate the steps taken to implement the methodology of modeling a simple customer in accordance with one aspect of the present invention.

FIG. 5 illustrates a modeling interaction diagram of the simplified purchase interaction of FIG. 3 in accordance with one aspect of the present invention.

FIG. 6 illustrates a modeling scheduling language syntax in extended Backus-Naur Form Notation (EBNF) in accordance with one aspect of the present invention.

FIG. 7 a illustrates a schedule construct in EBNF notation in accordance with one aspect of the present invention.

FIG. 7 b illustrates a schedule construct in XML notation in accordance with one aspect of the present invention.

FIG. 7 c illustrates an example of a simple schedule in accordance with one aspect of the present invention.

FIG. 8 a illustrates a port construct in EBNF notation in accordance with one aspect of the present invention.

FIG. 8 b illustrates a port construct in XML notation in accordance with one aspect of the present invention.

FIG. 9 a illustrates a message construct in EBNF notation in accordance with one aspect of the present invention.

FIG. 9 b illustrates a message construct in XML notation in accordance with one aspect of the present invention.

FIG. 10 a illustrates a contexts construct in EBNF notation in accordance with one aspect of the present invention.

FIG. 10 b illustrates a contexts construct in XML notation in accordance with one aspect of the present invention.

FIG. 11 a illustrates an action construct in EBNF notation in accordance with one aspect of the present invention.

FIG. 11 b illustrates an action construct in XML notation in accordance with one aspect of the present invention.

FIG. 11 c illustrates a graphical image representing a sink and a source action construct in accordance with one aspect of the present invention.

FIG. 12 illustrates a process construct in EBNF notation in accordance with one aspect of the present invention.

FIG. 13 a illustrates a zero construct in EBNF notation in accordance with one aspect of the present invention.

FIG. 13 b illustrates a zero construct in XML notation in accordance with one aspect of the present invention.

FIG. 13 c illustrates a graphical image representing a zero construct in accordance with one aspect of the present invention.

FIG. 14 a illustrates a sequence construct in EBNF notation in accordance with one aspect of the present invention.

FIG. 14 b illustrates a sequence construct in XML notation in accordance with one aspect of the present invention.

FIG. 14 c illustrates a graphical image representing a sequence construct in accordance with one aspect of the present invention.

FIG. 14 d illustrates implementation of a sequence construct in a schedule in accordance with one aspect of the present invention.

FIG. 15 a illustrates a silence construct in EBNF notation in accordance with one aspect of the present invention.

FIG. 15 b illustrates a silence construct in XML notation in accordance with one aspect of the present invention.

FIG. 16 a illustrates a task construct in EBNF notation in accordance with one aspect of the present invention.

FIG. 16 b illustrates a task construct in XML notation in accordance with one aspect of the present invention.

FIG. 16 c illustrates a graphical image representing a task construct in accordance with one aspect of the present invention.

FIG. 16 d illustrates implementation of a task construct in a schedule in accordance with one aspect of the present invention.

FIG. 17 a illustrates a call construct in EBNF notation in accordance with one aspect of the present invention.

FIG. 17 b illustrates a call construct in XML notation in accordance with one aspect of the present invention.

FIG. 18 a illustrates a return construct in EBNF notation in accordance with one aspect of the present invention.

FIG. 18 b illustrates a return construct in XML notation in accordance with one aspect of the present invention.

FIG. 19 a illustrates a release construct in EBNF notation in accordance with one aspect of the present invention.

FIG. 19 b illustrates a release construct in XML notation in accordance with one aspect of the present invention.

FIG. 20 a illustrates a switch construct in EBNF notation in accordance with one aspect of the present invention.

FIG. 20 b illustrates a switch construct in XML notation in accordance with one aspect of the present invention.

FIG. 20 c illustrates a graphical image representing a switch construct in accordance with one aspect of the present invention.

FIG. 20 d illustrates implementation of the switch construct in providing a loop function in accordance with one aspect of the present invention.

FIG. 21 a illustrates a map construct in EBNF notation in accordance with one aspect of the present invention.

FIG. 21 b illustrates a map construct in XML notation in accordance with one aspect of the present invention.

FIG. 21 c illustrates implementation of a map construct in a schedule in accordance with one aspect of the present invention.

FIG. 22 a illustrates a map construct in EBNF notation in accordance with one aspect of the present invention.

FIG. 22 b illustrates a map construct in XML notation in accordance with one aspect of the present invention.

FIG. 23 a illustrates a partition construct in EBNF notation in accordance with one aspect of the present invention.

FIG. 23 b illustrates a partition construct in XML notation in accordance with one aspect of the present invention.

FIG. 23 c illustrates a graphical image representing a partition construct in accordance with one aspect of the present invention.

FIG. 24 a illustrates a connect construct in EBNF notation in accordance with one aspect of the present invention.

FIG. 24 b illustrates a connect construct in XML notation in accordance with one aspect of the present invention.

FIG. 24 c illustrates a graphical image representing a connect construct in accordance with one aspect of the present invention.

FIG. 25 a illustrates a cut construct in EBNF notation in accordance with one aspect of the present invention.

FIG. 25 b illustrates a cut construct in XML notation in accordance with one aspect of the present invention.

FIG. 26 a illustrates an example of connecting ports using a cut expression in a schedule in accordance with one aspect of the present invention.

FIG. 26 b illustrates an example of connecting ports using a connect expression in a schedule in accordance with one aspect of the present invention.

FIG. 27 a illustrates a graphical representation of a customer business workflow process in accordance with one aspect of the present invention.

FIG. 27 b illustrates a customer business workflow schedule of the workflow process in FIG. 27 a written in SLANG syntax in accordance with one aspect of the present invention.

FIG. 28 a illustrates a graphical representation of a supplier business workflow process in accordance with one aspect of the present invention.

FIG. 28 b illustrates a supplier business workflow schedule of the workflow process in FIG. 28 a written in SLANG syntax in accordance with one aspect of the present invention.

FIG. 29 a illustrates a graphical representation of a shipper business workflow process in accordance with one aspect of the present invention.

FIG. 29 b illustrates a shipper business workflow schedule of the workflow process in FIG. 28 a written in SLANG syntax in accordance with one aspect of the present invention.

FIG. 30 a illustrates a graphical representation of a combined business workflow process in accordance with one aspect of the present invention.

FIGS. 30 b-c illustrate a combined business workflow schedule of the workflow process in FIG. 30 a written in SLANG syntax in accordance with one aspect of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

The present invention is now described with reference to the drawings, wherein like reference numerals are used to refer to like elements throughout. The present invention is described with reference to a method for representing process algebras, for describing distributed and parallel computing, into an XML schema. The present invention identifies how process algebraic techniques may be syntactically embedded in a system that describes transaction workflow. The invention further addresses the compositional specification of the behavior of autonomously executing systems. Autonomously executing systems can be defined as computer codes that comprise a unit of business functionality. It is to be appreciated that without a machine readable and executable specification, system integration across organizational boundaries (e.g., departmental, divisional, cross enterprise) is extremely complex. However, with a machine readable and executable specification systems integration may be largely automated. Specifically, the following components may be utilized to synthesize and deploy a system comprised of autonomously executing subsystems: a compositional, machine-readable, executable specification of the synchronization constrains of each subsystem; a description of how to access and load the subsystems; and a binding between the subsystems and the descriptions of synchronization constraints thereof. Synthesis of such systems from executable specifications significantly reduces cost of development, maintenance and reduces opportunity for errors. Thus, cost of developing and managing applications that span business units connected by communications networks (e.g., the Internet) is greatly reduced.

FIG. 1 a illustrates a methodology of reducing a mobile process algebra to an executable specification. Examples of process algebra include Π-calculus, Blue calculus and Join calculus. At step 2, a process algebra grammar for a computing system is provided. At step 4, the process algebra grammar is rewritten to infix notation. Operators of the process algebra are then assigned XML tags to form language constructs at step 6. At step 10, annotating tags around the basic process calculus constructors are provided. This step allows introduction of syntax for expressing transactional semantics to basic synchronization constraints. It is to be appreciated that the steps illustrated in FIG. 1 a can easily be implemented by employing a software program. It is further to be appreciated that the steps illustrated in FIG. 1 a can be easily implemented by employing a system having a computer and software for providing XML constructs given a process algebra. FIG. 1 b illustrates an example of a process algebra and its structural equivalence utilized in formulating a model for conducting business workflow transactions. The process algebra of the present model is a derivation of Π-calculus (e.g., combinators). However, conventional Π-calculus algebra is based on a single verb, while the process algebra of the present invention includes two verbs. The use of two verbs allows for explicitly representing parallelism within the business workflow process by separating communicating concurrent transactions from independent concurrent transactions and mitigating deadlock associated with conventional systems. The process algebra can then be converted to an XML schema. The XML schema is illustrated in the attached Appendix in paragraph A, which is part of this specification. A document type definition (DTD) for defining data types is illustrated in paragraph B of the Appendix.

An example of converting a process algebra to a syntax will know be described with respect to Π-calculus. The syntactic categories include actions and processes and anything that is not an action will generally be a process. For example, starting with a process definition in Π-calculus of the form x0(x1).x1(x2).x2(x3).0 represented in infix notation, this expression can be rewritten in prefix notation. However, instead of writing “.” in prefix notation, a keyword for the operator can be substituted. That is for the meaning of “.”, the keyword “seq” (short for sequence) is assigned. The expression then becomes seq(x0(x1),seq(x1(x2),seq(x2(x3),0))). Making the inner seq expressions implicit, which is common in programming languages, then the expression can be transformed to the expression seq(x0(x1),x1(x2),x2(x3),0). Similarly, for each operator in the Π-calculus the same steps may be performed. The conversion operations can be expressed as infix2Prefix and treated as a syntactic transformation. Inputting a Π-calculus expression P into the conversion operation infix2Prefix results in a semantically equivalent version in prefix notation. Table I illustrates assigning keywords to Π-calculus expressions.

TABLE I pi operator Keyword -.- Seq -|- Par -+- Switch The constructs can be represented recursively as follows: infix2Prefix(a.P)=seq(infix2Prefix(a),infix2Prefix(P)) infix2Prefix(P|Q)=par(infix2Prefix(P),infix2Prefix(Q)) infix2Prefix(P+Q)=switch(infix2Prefix(P),infix2Prefix(Q))

Now, the next step is to represent the prefix notation expression in XML by structural induction. Starting with the sequence example, the target representation system basically allows us to define elements. So, a seq expression will be an element. If xml(E) is used to stand for the xml transformation of our prefix expressions, then xml(seq(a,P))<sequence>xml(a)xml(P)</sequence> Similarly, xml(par(P,Q))<parallel>xml(P)xml(Q)</parallel> xml(switch(P,Q))=<switch>xml(P)xml(Q)</switch>

The difference between this exposition and the reduction of combinators is that the combinators are based on an assumption that the process calculus comes with distinct operators for independent, isolated execution and parallel but communicating execution. In other words, combinators provide a pair of operators (i.e., _*_ and _;_) where the Π-calculus comes with only one, _|_. The pair of operators can be given the keywords ‘independent’ and ‘communicates.’

FIG. 1 c illustrates a flow diagram of a business process 20 employing an example of the derived process algebra model of the present invention. In step 25, the process begins and divides into an independent business transaction (T1) 35 and an interdependent business transaction (T2) 30. A transaction may include a single action in a business operation, a single business operation or a number of business operations in a business process. The model allows for explicit separation of independent business transaction (T1) 35 from the interdependent business transaction (T2) 30. Although independent transaction (T1) 35 and interdependent transaction (T2) 30 can be executed concurrently, the model allows for independent transactions to be executed on machines separated and isolated from the machine utilized to execute interdependent transactions, because interdependent transactions do not require information regarding results of independent transactions. Therefore, significant throughput and decreased latency of a business process is achieved employing the model of the present invention.

Interdependent transaction (T2) 30 is a parent transaction and includes interdependent child transaction (T3) 40, interdependent child transaction (T4) 45 and interdependent child transaction (T5) 50, which execute concurrently. Interdependent parent transaction (T2) 30 does not commit until the last of the concurrent child interdependent transactions 40, 45 and 50 commit. Therefore, the committing of the interdependent parent transaction (T2) 30 is not dependent on the communication between the concurrent child interdependent transactions as is conventional, but commits after the last concurrent child interdependent transaction commits, again resulting in decreased latency of the business process. Conventional systems isolate concurrent interdependent transactions from one another such that each transaction views other concurrent interdependent transactions as committing before or after the viewing transaction (e.g., sequential). The present model loosens isolation, such that committing of concurrent interdependent transactions occurs after a final concurrent interdependent transaction has committed, thus providing another level of parallelism (e.g., communicating parallelism). After each concurrent interdependent transaction commits, data is transferred to step 60 which determines whether or not the last transaction has committed. Upon commitment of the last concurrent interdependent transaction, the parent interdependent transaction (T2) 30 commits and the data is transferred concurrently to step 65. At step 65, the business process 20 determines whether a decision is allowed (Yes) in step 70 or denied (No) in step 75 based on the transmitted data.

In addition to the above stated features, the model allows for concurrent execution of actions within transactions. Transactions will not commit until a final action within a transaction has completed. The model also allows for explicit determination of transaction boundaries in addition to increased granularity of transactions. For example, transaction (T5) 50 has been defined as having four actions, while transaction (T3) 40 and (T4) 45 has been defined as including three and four actions, respectively. Transaction (T2) 30 has been defined as including transaction (T3) 40, (T4) 45 and (T5) 50, but can be defined as any two of transaction (T3) 40, (T4) 45 and (T5) 50 or simply any of transaction (T3) 40, (T4) 45 and (T5) 50. Therefore, the present invention allows for defining transaction boundaries and increasing granularity. Additionally, actions can happen concurrently independent of isolation because the data that the actions work on are independent of one another. Since isolation of the model has been relaxed to allow for increased granularity, transactions cannot simply be rolled back upon a failure of a single transaction, as is conventional. This is because the data associated with committed interdependent transactions is not locked after commitment, and therefore data may be compromised before another concurrent interdependent transaction fails. Therefore, the present invention allows for compensation to be invoked upon a failure of a transaction or an action. The compensation can be invoked to include compensating tasks for committed interdependent concurrent transactions and all committed transactions and actions outside the parent transaction. However, compensation upon a failure can include any compensating action to be invoked based on a particular application or desire.

FIG. 1 d illustrates invocation of a compensation routine upon a failure of any of concurrent child interdependent transactions (T3) 40, (T4) 45 and (T5) 50 of interdependent parent transaction (T2) 30. At step 80, the interdependent parent transaction (T2) 30 begins executing in the business process 20. At step 90, the concurrent child interdependent transactions (T3) 40, (T4) 45 and (T5) 50 begin execution. The business process then waits for a last concurrent interdependent child transaction to commit at step 100. If all three concurrent child interdependent transactions commit (Yes), the business process advances to step 130 and interdependent parent transaction (T2) 30 commits. The data is then transmitted to a decision maker at step 140. If all three concurrent child interdependent transactions do not commit (No) at step 100, there is a transaction failure with respect to interdependent parent transaction (T2) 30 at step 105. The business process then determines if any of the concurrent child interdependent transactions (T3) 40, (T4) 45 and (T5) 50 have failed at step 110. If one of the concurrent child interdependent transactions (T3) 40, (T4) 45 and (T5) 50 has failed (Yes), a compensation routine is run for the particular failed transaction at step 115. If one of the concurrent child interdependent transactions (T3) 40, (T4) 45 and (T5) 50 has not failed (No), a compensation routine is run with respect to the interdependent parent transaction (T2) 30 at step 120. It is to be appreciated that parent transaction can call compensators within the child transaction or call its own compensators, as a result of a failure. Additionally, calls can be made from the failed transaction and compensation made based on information within the committed transactions. The compensation information may come from a logged database. Since isolation has been loosened with respect to the parent transaction, only data of a child transaction will be locked during execution. Therefore, once the child transaction commits, the failed transaction can access data with respect to any committed transaction. FIG. 1 d illustrates compensation of committed interdependent child transactions as a result of a failure of another interdependent child transaction. It is to be appreciated that compensation is also necessary for transactions outside the parent transaction.

FIG. 2 a and the following discussion are intended to provide a brief, general description of a suitable computing environment in which the invention may be implemented. While the invention will be described in the general context of computer-executable instructions of a computer program that runs on a server computer, those skilled in the art will recognize that the invention also may be implemented in combination with other program modules. Generally, program modules include routines, programs, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Moreover, those skilled in the art will appreciate that the invention may be practiced with other computer system configurations, including single- or multiprocessor computer systems, minicomputers, mainframe computers, as well as personal computers, hand-held computing devices, microprocessor-based or programmable consumer electronics, and the like. The illustrated embodiment of the invention also is practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. But, some embodiments of the invention can be practiced on stand-alone computers. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.

With reference to FIG. 2 a, an exemplary system for implementing the invention includes a conventional server computer 320, including a processing unit 321, a system memory 322, and a system bus 323 that couples various system components including the system memory to the processing unit 321. The processing unit may be any of various commercially available processors, including Intel x86, Pentium and compatible microprocessors from Intel and others, including Cyrix, AMD and Nexgen; Alpha from Digital; MIPS from MIPS Technology, NEC, IDT, Siemens, and others; and the PowerPC from IBM and Motorola. Dual microprocessors and other multi-processor architectures also can be used as the processing unit 321.

The system bus may be any of several types of bus structure including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of conventional bus architectures such as PCI, VESA, Microchannel, ISA and EISA, to name a few. The system memory includes read only memory (ROM) 324 and random access memory (RAM) 325. A basic input/output system (BIOS), containing the basic routines that help to transfer information between elements within the server computer 320, such as during start-up, is stored in ROM 324.

The server computer 320 further includes a hard disk drive 327, a magnetic disk drive 328, e.g., to read from or write to a removable disk 329, and an optical disk drive 330, e.g., for reading a CD-ROM disk 331 or to read from or write to other optical media. The hard disk drive 327, magnetic disk drive 328, and optical disk drive 330 are connected to the system bus 323 by a hard disk drive interface 332, a magnetic disk drive interface 333, and an optical drive interface 334, respectively. The drives and their associated computer-readable media provide nonvolatile storage of data, data structures, computer-executable instructions, etc. for the server computer 320. Although the description of computer-readable media above refers to a hard disk, a removable magnetic disk and a CD, it should be appreciated by those skilled in the art that other types of media which are readable by a computer, such as magnetic cassettes, flash memory cards, digital video disks, Bernoulli cartridges, and the like, may also be used in the exemplary operating environment.

A number of program modules may be stored in the drives and RAM 325, including an operating system 335, one or more application programs 336, other program modules 337, and program data 338. The operating system 335 in the illustrated server computer is the Microsoft Windows NT Server operating system, together with the before mentioned Microsoft Transaction Server.

A user may enter commands and information into the server computer 320 through a keyboard 340 and pointing device, such as a mouse 342. Other input devices (not shown) may include a microphone, joystick, game pad, satellite dish, scanner, or the like. These and other input devices are often connected to the processing unit 321 through a serial port interface 346 that is coupled to the system bus, but may be connected by other interfaces, such as a parallel port, game port or a universal serial bus (USB). A monitor 347 or other type of display device is also connected to the system bus 323 via an interface, such as a video adapter 348. In addition to the monitor, server computers typically include other peripheral output devices (not shown), such as speakers and printers.

The server computer 320 may operate in a networked environment using logical connections to one or more remote computers, such as a remote client computer 349. The remote computer 349 may be a workstation, a server computer, a router, a peer device or other common network node, and typically includes many or all of the elements described relative to the server computer 320, although only a memory storage device 350 has been illustrated in FIG. 2 a. The logical connections depicted in FIG. 2 a include a local area network (LAN) 351 and a wide area network (WAN) 352. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the Internet.

When used in a LAN networking environment, the server computer 320 is connected to the local network 351 through a network interface or adapter 353. When used in a WAN networking environment, the server computer 320 typically includes a modem 354, or is connected to a communications server on the LAN, or has other means for establishing communications over the wide area network 352, such as the Internet. The modem 354, which may be internal or external, is connected to the system bus 323 via the serial port interface 346. In a networked environment, program modules depicted relative to the server computer 320, or portions thereof, may be stored in the remote memory storage device. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used.

In accordance with practices of persons skilled in the art of computer programming, the present invention is described below with reference to acts and symbolic representations of operations that are performed by the server computer 320, unless indicated otherwise. Such acts and operations are sometimes referred to as being computer-executed. It will be appreciated that the acts and symbolically represented operations include the manipulation by the processing unit 321 of electrical signals representing data bits which causes a resulting transformation or reduction of the electrical signal representation, and the maintenance of data bits at memory locations in the memory system (including the system memory 322, hard drive 327, floppy disks 329, and CD-ROM 331) to thereby reconfigure or otherwise alter the computer system's operation, as well as other processing of signals. The memory locations where data bits are maintained are physical locations that have particular electrical, magnetic, or optical properties corresponding to the data bits.

FIG. 2 b illustrates an alternative environment for employing the present invention. A system 360 is shown in which multiple buyers 365 and sellers 370 are electronically linked via a central server 375. As discussed in more detail below, the central server 375 is configured to provide the buyers 365 and sellers 370 with a convenient forum in which to conduct business transactions in accordance with a business workflow methodology described herein. The forum may, for example, be a preestablished Internet web page where buyers 365 are able to submit purchase requests and sellers 370 are able to file responses to these purchase requests. For example, a buyer may be able to file a purchase request in accordance with a purchase request electronic form and the vendor return a purchase request confirmation electronic form. The electronic forms can reside in a database on a central server 375 or can be created based on messages transmitted by buyers 365 and sellers 370.

Each of the buyers 365 and sellers 370 may access the central server 375 in any of a variety of ways. For example, each buyer 365 and seller 370 is shown to be part of separate establishments 380 which include one or more respective computer systems 385 and local servers 390. The computer systems 385 may be, for example, a desktop or laptop computer with a local area network (LAN) interface for communicating over a network backbone 395 to the local server 390. The local servers 390, in turn, interface with the central server 375 via a network cable 400 or the like. It is to be appreciated that while the computer system 385 is depicted communicating with the central server 375 via hardwired network connections, the computer system 385 may interface with the central server 375 using a modem, wireless local area and/or wide area networks, etc. Further, it will be appreciated, that while the buyers 365 and sellers 370 are shown to part of separate establishments, the buyers 365 and sellers 370 can be part of a single establishment and represent different divisions or groups within a single business. Although, an example of an environment has been described with respect to a central server and several clients, it is to be appreciated that the present invention can be employed utilizing a peer to peer communication and composition.

The model of the present invention can be reduced to a programming language. The model of the present invention will now be illustrated with respect to an example of a business workflow process and a scheduling programming language written in XML (hereinafter referred to as SLANG) including syntax that allows for expression of features associated with the model of the present invention. The programming language allows for users to choose between conventional features of business workflow processes and model specific features in formulating custom models for the user's particular business workflow process. The language is inherently concurrent and allows a user to specify dependency and independence between components, transaction, compensation and checkpoint boundaries, as well as mechanisms for abstracting the workflow from the implementations of the components. Although, the present example refers to a scheduling language, it is to be appreciated that the present invention can apply to a variety of application programming language and is not specifically limited to a scheduling language.

The scheduling language provides a mechanism for describing and executing concurrent instances of components. The scheduling language may employ a graphical user interface that can describe dataflow by utilizing a dataflow diagram where actions are connected via data flow between them. The actions can be mapped to invocations on, for example, common object model (COM) objects, messages in queues, or other native technology behavior. The schedule easily maps onto a distributed environment due to its inherent concurrency, and can further be used to compose other schedules. A schedule can be examined at design time for deadlocks. A compiler can detect deadlock conditions between concurrent actions. A schedule can be stored on a file system, in a database, or embedded in a stream in an application. It is to be appreciated that variation of the business workflow process described herein and the programming language implementing the example would be apparent to those skilled in the art.

FIG. 3 illustrates a simple purchase interaction diagram in a system with autonomous interacting agents. The agents (e.g., customer, supplier and shipper) are autonomous in that their activities are concurrent and their lifetimes independent of one another. The interactions between the agents are manifested as exchanges of messages between each other (e.g., purchase orders, purchase order confirmations, ship order). The following example is centered on describing agents in terms of ordering of messages sent and received by the agents and modeling the entire system as a composition of individual agents. A completed purchase in which a product is received by the customer and the product paid for by the customer, represents a completed business workflow process. FIGS. 4 a-4 d illustrate treatment of the customer agent with respect to the programming language SLANG evolved from the business workflow model of the present invention. The atomic part of modeling utilizing the SLANG programming language is the description of elemental sending and receipt of messages referred to as actions (FIG. 4 b). For each action, the SLANG programming language allows defining of the abstract location where a message is to be sent, known as a port, and from which port that the message is being received (FIG. 4 c). Furthermore, the programming language SLANG allows a user to specify the ordering of individual actions in addition to whether those actions will be performed sequentially or concurrently (FIG. 4 d). FIG. 5 illustrates the interaction between customer, supplier and shipper through messages sent and received by the ports. An example of concurrency is illustrated by the invoice receipt action and the ETA receipt action in the customer agent.

It is to be appreciated that the SLANG programming language allows the description of elaborate ordering of actions. However, the descriptions of the actions remain abstract in that each action is expressed only in terms of a port and a message. This abstraction allows for modeling of business workflow processes across various technologies by providing the binding in a separate routine that describes the concrete realization of actions onto the various technologies (e.g., a COM component, a database table).

FIG. 6 illustrates an example of the SLANG programming language syntax defined in Extended Backus-Naur Form (EBNF). The syntax includes schedule, ports, messages, contexts and process syntax. FIG. 7 a illustrates schedule syntax in EBNF, while FIG. 7 b illustrates schedule syntax in XML. A schedule first declares ports, messages and contexts and then describes an ordering of actions. An example of such a declaration is illustrated in FIG. 7 c. FIG. 8 a illustrates port syntax in EBNF, while FIG. 8 b illustrates port syntax in XML. Ports are named abstract locations where messages are sent to and received from. Messages are named abstract data segments sent to and received from ports. Message syntax in EBNF is illustrated in FIG. 9 a. Message syntax is illustrated in XML in FIG. 9 b. Contexts are named escape points associated to some single action or process contained in a schedule. An attribute on a process or action referring to the context name effects the association to that context. A context is a label indicating where control is to be transferred when context is invoked (e.g., return). Optionally, a context can be a transaction indicating atomicity of the associated process or action. Additionally, an optional process form can accompany a transactional context to describe compensating behavior required to undo effects of the process action associated with the context. FIG. 10 a illustrates context syntax in EBNF, while FIG. 10 b illustrates context syntax in XML. Context allows the user to implement compensation tasks associated with transaction failures.

The schedule body describes the process or flow of messages to ports. The basic element of a process is an action. The schedule body combines the action into more elaborate processes. An action can either be a sink, indicating that the schedule is to wait for messages to arrive at a port, or a source specifying a particular message to be sent to a port. An action completes once the message is delivered to the port. Action syntax in EBNF is illustrated in FIG. 11 a. Action syntax is illustrated in XML in FIG. 11 b. The optional contextref syntax refers to a named escape point that can be utilized at the action level for compensation upon failure of the action. A graphical user interface component for both sink and source actions is illustrated in FIG. 11 c. The graphical user interface components can be implemented for providing users a simplified method of formulating models of business workflow processes. The graphical user interface components can then be converted to programmable SLANG syntax.

FIG. 12 illustrates in EBNF notation process construct syntax. Process constructs combine actions and processes into elaborate processes. FIG. 13 a illustrates EBNF notation for a zero construct, while FIG. 13 b illustrates the zero construct in XML. Zero indicates a process that does nothing. A graphical user interface component of a zero construct is illustrated in FIG. 13 c.

A sequence consists of a collection of generic actions that are executed serially. In addition to the basic actions source and sink, generic actions include silence, task, call, return and release. An optional process form concludes the sequence. A sequence completes when its last element (generic action or optional process) completes. FIG. 14 a illustrates EBNF notation for a sequence constructor, while FIG. 14 b illustrates the sequence constructor in XML. A graphical user interface component for a sequence constructor is illustrated in FIG. 14 c. An example of a simple sequence is illustrated in FIG. 14 d. The sequence operates sequentially with the sink action being performed and then the source action. Silence denotes a generic action that does nothing. FIG. 15 a illustrates EBNF notation for a silence generic action, while FIG. 15 b illustrates the silence generic action in XML.

A task consists of a collection of independent concurrent actions (e.g. source or sink) that are executed in parallel. FIG. 16 a illustrates EBNF notation for a task constructor, while FIG. 16 b illustrates the task constructor in XML. A graphical user interface component is illustrated in FIG. 16 c. An example of a simple task is illustrated in FIG. 16 d. The task operates concurrently with both the source actions being performed in parallel. The task completes when all of the actions within the task complete. The task constructor allows the user to group actions and sequences, such that they execute concurrently.

A call represents the invocation of another schedule. FIG. 17 a illustrates EBNF notation for a call constructor, while FIG. 17 b illustrates the call constructor in XML. A call completes when the called schedule completes. A call mentions optional lists of ports and message names that are passed in as actual parameters to the called schedule. In the called schedule those ports and message references are positionally matched against that schedule ports and messages. The generic action return denotes an escape that effects a transfer of control to the named context. FIG. 18 a illustrates EBNF notation for a return constructor, while FIG. 18 b illustrates the return constructor in XML. Release indicates that the named context will not be invoked in the subsequent actions of the current process. FIG. 19 a illustrates EBNF notation for a release constructor, while FIG. 19 b illustrates the release constructor in XML. The call, return and release constructors allow users to implement compensations based on failed actions and transactions.

A switch constructor is provided specifying a list of possible branches in the control flow. Each branch consists of a case or an optional default. The cases are guarded by a test on a pair of messages. The control flow executes the process in the first case whose guard evaluates to true. The semantics of the test guarding a case is not specified in the programming language but the meaning of the test is elaborated in the schedule's binding. FIG. 20 a illustrates EBNF notation for a switch constructor, while FIG. 20 b illustrates the switch constructor in XML. A graphical user interface component representing the switch constructor is illustrated in FIG. 20 c. An example of implementing the switch constructor in providing a loop function is illustrated in FIG. 20 d. The loop is encapsulated in a schedule that is called from the main schedule with a switch testing for the loop invariant and a tail recursive call ending the loop body. When the “loopExample” schedule is called, the schedule will repeatedly wait for message m on port p until the match rule named by test evaluates to false when applied against the message pair m and mTrue.

A map construct is provided that runs a process within the scope of ports-to-messages mapping. FIG. 21 a illustrates EBNF notation for a map construct, while FIG. 21 b illustrates the map construct in XML. An example of implementing the map construct is provided in FIG. 21 c. Each assignment in a map denotes that a message contains a reference to a port. In the process scoped by map, that port is the mapped to that message. A copy construct is provided that creates new instances of a process as needed. For example, a process is created if such creation would cause some action to occur, for example, when a message is delivered to the port corresponding to the first sink action of a copied schedule an instance of that schedule is created. FIG. 22 a illustrates EBNF notation for a map construct, while FIG. 22 b illustrates the map construct in XML.

A partition construct describes a collection of independent concurrent processes. The partition construct allows the users to represent transactions as autonomous independent transactions separate from concurrent interdependent transactions. In the present example, independent refers to the fact that each process in the partition refers to different ports, while concurrent meaning that all the processes in the partition proceed in parallel. FIG. 23 a illustrates EBNF notation for a partition construct, while FIG. 23 b illustrates the partition construct in XML. A graphical user interface component representing a partition is illustrated in FIG. 23 c. A connect construct allows for modeling a simple form of communication between processes. FIG. 24 a illustrates EBNF notation for a connect construct, while FIG. 24 b illustrates the connect construct in XML. A graphical user interface component representing a connect construct is illustrated in FIG. 43 c. The connect construct allows the users to connect processes. For example, if a source action having a port p and a message m occurs in a connected process that is connected to a sink action having a port q and a message n, the message m from the source action will be received by the sink action as a message n.

An alternate construct for providing communications among processes called a cut expression is provided. FIG. 25 a illustrates EBNF notation for a cut construct, while FIG. 25 b illustrates the cut construct in XML. The cut construct takes three processes as arguments and, itself, denotes a process. Three processes are, in order, a receiver, a sender, and a mediator. In most cases, the connect expression is adequate, which takes a receiver, a sender and a list of port pairs to connect. The connect construct implicitly creates a mediator from the port pair connection list. However, the more general cut expression is available for cases in with the mediator might be considered non-trivial. The purpose of the mediator is to connect ports between the sender and receiver. Without the availability of the cut construct, the sender and receiver must agree ahead of time not only on the names of the ports over which they communicate, but also make sure that those port names are in an isolated namespace, to ensure that they do not collide with ports in other processes. Cut relieves this burden on the communicating pair by placing it on a mediator. The mediator is little more than a list of ports that sender and receiver may share via shared binding constructions. For example, suppose a sender process was a source action with a port x and a message location w, and a receiver process was a sink action with a port x and a message location y, then a mediator process would be a sink action having a port u with a message location y. FIG. 26 a illustrates the job of communicating message w to the receiver, via the private port u, so long as port z is bound in message y in all three processes. FIG. 26 b illustrates an equivalent connect expression corresponding to the cut expression of FIG. 26 a.

The above described syntax, formulated from the model of the present invention, allows for users to choose between conventional features of business workflow processes and model specific features in formulating custom models for the user's particular business workflow process. In particular, syntax is provided that allows users to explicitly separate autonomous independent business transactions from the interdependent concurrent business transactions, define transaction boundaries and thus improve granularity in the custom model. The syntax also allows a user to define compensating behavior as a result of failed transactions and synchronize concurrent interdependent actions and transactions based on completion of all the concurrent interdependent actions and transactions, respectively.

The syntax will now be described with reference to a simple customer-supplier example. FIGS. 27 a-b illustrate a simple customer business workflow process. FIG. 27 a illustrates the user graphical interface representing the business workflow process that may be formulated by the user, while FIG. 27 b illustrates the corresponding schedule of the graphical interface containing SLANG syntax. The schedule name “customer” is declared in line 01. The header consists of lines 03-18 and includes portlist definitions (lines 04-10) and message list definitions (lines 11-17). The main body of the schedule is contained within lines 20-33 and begins with a sequence start tag and ends with a sequence end tag. As illustrated in the body, actions are performed sequentially within the sequence tags, except for actions within a task start tag and a task end tag, which are performed concurrently. The actions within the task tags represent the concurrent actions of the customer receiving an ETA message and an invoice message. The schedule will move to the next action (e.g., send payment) after the last message, of the concurrent actions, is received.

FIGS. 28 a-b illustrate a simple supplier business workflow process. FIG. 28 a illustrates the user graphical interface representing the business workflow process that may be formulated by the user, while FIG. 28 b illustrates the corresponding schedule of the graphical interface containing SLANG syntax. The schedule name “supplier” is declared in line 01. The header consists of lines 03-18 and includes portlist definitions (lines 04-10) and message list definitions (lines 11-17). The main body of the schedule is contained within lines 20-31 and begins with a sequence start tag and ends with a sequence end tag. As illustrated in the body, actions are performed sequentially within the sequence tags, which does not include any concurrent actions. FIGS. 29 a-b illustrate a simple shipper business workflow process. FIG. 29 a illustrates the user graphical interface representing the business workflow process associated with the shipper that may be formulated by the user, while FIG. 29 b illustrates the corresponding schedule of the graphical interface containing SLANG syntax. The schedule name “shipper” is declared in line 01. The header consists of lines 03-12 and includes portlist definitions (lines 04-7) and message list definitions (lines 8-11). The main body of the schedule is contained within lines 14-19 and begins with a sequence start tag and ends with a sequence end tag. As illustrated in the body, actions are performed sequentially within the sequence tags.

FIGS. 30 a-c illustrate a combined customer supplier business workflow process. FIG. 30 a illustrates the user graphical interface representing the business workflow process that may be formulated by the user, while FIGS. 30 b-c illustrate the corresponding schedule of the graphical interface containing SLANG syntax. The schedule name “customerSupplier” is declared in line 01. The header consists of lines 03-18 and includes portname declarations. The main body of the schedule is contained within lines 20-60. A connection routine is provided in lines 29-47 for connecting the supplier schedule to the shipper schedule. A second connection routine is provided in lines 20-60 for connecting the customer schedule to the supplier and shipper connected schedule. This allows for the operations within the separate schedules to run concurrently, while providing communicating coupling between business operations of different entities.

The present invention has been illustrated with respect to a particular process algebra and a particular example, however, it is to be appreciated that various process algebras and examples can be employed in carrying out the present invention. It is further to be appreciated that any programming methodology and/or computer architecture suitable for carrying out the present invention may be employed and are intended to fall within the scope of the hereto appended claims.

The invention has been described with reference to the preferred embodiments. Obviously, modifications and alterations will occur to others upon reading and understanding the foregone detailed description. It is intended that the invention be construed as including all such modifications alterations, and equivalents thereof.

A. SLANG XML SCHEMA <?xml version=“1.0”?> <!DOCTYPE schema PUBLIC ”-/ /W3C/ /DTD XML Schema Version 1.0/ /EN” SYSTEM “http:/ /www.w3.org/1999/09/24/24-xmlschema/ structures/“> <schema xmlns=“http:/ /www.w3org/1999/09/23-schema/” targetNS=“http:/ /www.microsoft.com/msworkflow/specifications” version=“0.9”> <!-- imports --> <!-- exports? --> <!-- Processes are built out of actions; actions are built on names. . . --> <!-- The entire structure depends on references --> <archetype name=“namedEntity” model=“refinable”> <attribute name=“identity” type=“string”/> <attribute name=“name” type=“string”/> </archetype> <archetype name=“typedRef” model=“refinable”> <attribute name=“location” bype=“uri”/> </archetype> <element name=“portRef”> <archetype> <refines name=“typedRef”> </archetype> </element> <element name=“messageRef”> <archetype> <refines name=“typedRef”> </archetype> </element> <element name=“contextRef”> <archetype> <refines name=“typedRef”> </archetype> </element> <element name=“scheduleRef”> <archetype> <refines name=“typedRef”> </archetype> </element> <!-- The structure of actions. . . --> <archetype name=”action” model=“refinable”> </archetype> <archetype name=“ioAction” model=“refinable”> <refines name=“action”/> <element ref=“portRef”/> <element ref=“messageRef”/> <element ref=“contextRef”/> </archetype> <archetype name=“cntlAction” model=“rfinable”> <refines name=“action”/> <element ref=“contextRef”/> </archetype> <!-- The structure of processes. . . --> <archetype name=“process” model=”refinable”> <group order=“choice” minOccurs=“1” maxOccurs=“1”> <element ref=“zero”/> <element ref=“sequence”/> <element ref=“switch”/> <element ref=“map”/> <element ref=“partition”/> <element ref=“connect”/> <element ref=“cut”/> <element ref=“copy”/> </group> </archetype> <!-- concrete types --> <!-- Begin Sequential Fragment --> <element name=“zero”> <archetype> <refines name=“process”/> </archetype> </element> <!-- Sequence and all that's necessary to specify it. . . --> <element name=“sequence”> <archetype> <refines name=“process”/> <group order=“sequence” minOccurs=“0” maxOccurs+“*”> <element ref=“action”/> </group> <element ref=“process”/> </archetype> </element> <!-- the concrete actions --> <element name=“sink”> <archetype> <refines name=“ioAction”/> </archetype> </element> <element name=“source”> <archetype> <refines name=“ioAction”/> </archetype> </element> <element name=“task”> <archetype> <refines name=“action”/> <group order=“all” minOccurs-“0” maxOccurs=“*”> <element ref=“action”/> </group> </archetype> </element> <element name=“return”> <archetype> <refines name-“cntlActin”/> </archetype> </element> <element name=“release”> <archetype> <refines name=“cntlAction”/> </archetype> </element> <!-- Switch and all that's necessary to specify it. . . --> <element name=“switch”> <archetype> <refines name=“process”/> <group order=“sequence” minOccurs=“0” maxOccurs=“*”> <element ref=“branch”/> </group> </archetype> </element> <element name=“branch”> <archetype> <group order=“choice” minOccurs=“1” maxOccurs=“1”> <element ref=“case”/> <element ref=“default”/> </group> <element ref=“process”/> </archetype> </element> <element name=“case”> <archetype> <group minOccurs=“1” maxOccurs=“1’> <element ref=“message”/> <element ref=“message”/> </group> </archetype> </element> <!-- Map and all that's necessary to specify it. . . --> <element name=“map”> <archetype> <refines name=“process”/> <group order=“sequence” minOccurs=“0” maxOccurs=“*”> <element ref=“assignment”/> </group> <element ref=“process”/> </archetype> </element> <element name=“assignment”> <archetype> <element ref=“message”/> <element ref=“port”/> </archetype> </element> <!-- End Sequential Fragment --> <!-- Begin Parallel Fragment --> <!-- Partition and all that's necessary to specify it. . . --> <element name=“partition”> <archetype> <refines name=“process”/> <group order=“sequence” MinOccurs=“0”maxOccurs=“*”> <element ref=“process”/> </group> </archetype> </element> <!-- Connect and all that's necessary to specify it. . . --> <element name=“connect”> <archetype> <refines name=“process”/> <group> <element ref=“process”/> <element ref=“process”/> <element ref=¢connectionList”/> </group> </archetype> </element> <element name=“connectionList”> <archetype> <group> <element ref=“connection”/> </group> </archetype> </element> <element name=“connection”> <archetype> <group minOccurs=“1” maxOccurs=“1”> <element ref=“port”/> <elementref=“port”/> </group> </archetype> </element> <!-- Cut and all that's necessary to specify it. . . --> <element name=“cut”> <archetype> <refines name=“process”/> </archetype> </element> <!-- Cut and all that's necessary to specify it. . . --> <element name=“copy”> <archetype> <refines name=“process”/> </archetype> </element> <!-- Schedule and all that's necessary to specify it. . . --> <element name=“schedule”> <archetype> <element ref=“header”/> <element ref=“process”/> </archetype> </element? <element name=“header”> <archetype> <group minOccurs+“1” maxOccurs=“1”> <element ref=“portList”/> <element ref=“messageList”/> </group> </archetype> </element> <element name=“portList”> <archetype> <group> <element ref=“port”/> </group> </archetype> </element> <element name=“messageList”> <archetype> <group> <element ref=“message”/> </group> </archetype> </element> <element name=“port”> <archetype> <refines name=“namedEntity”/> </archetype> </element> <element name=“message”> <archetype> <refines name=“namedEntity”/> </archetype> </element> <element name=“context”> <archetype> <refines name=“namedEntity”/> <attribute name=“transactional” type=“boolean”/> <element ref=“process”/> </archetype> </element> <element name=“contextList”> <archetype> <group> <element ref=“context”/> </group> </archetype> </element> </schema> B. SLANG DTD <!ELEMENT schedule (header?, (zero | sequence | switch | map | copy | partition | connect | cut)?, contextRef?)> <!ATTLIST schedule name ID #IMPLIED guid CDATA #IMPLIED> <!ELEMENT scheduleRef EMPTY> <!ATTLIST scheduleRef location CDATA #REQUIRED> <!ELEMENT header (portList?, messageList?, contextList?)> <!ELEMENT portList (port*)> <!ELEMENT port EMPTY> <!ATTLIST port name ID #REQUIRED> <!ELEMENT portRef EMPTY> <!ATTLIST portRef location CDATA #REQUIRED> <!ELEMENT messageList (message*)> <!ELEMENT message EMPTY> <!ATTLIST message name ID #REQUIRED> <!ELEMENT messageRef EMPTY> <!ATTLIST messageRef location CDATA #REQUIRED> <!ELEMENT contextList (context*)> <!ELEMENT context (transactional?)> <!ATTLIST context name ID #REQUIRED> <!ELEMENT transactional (zero | sequence switch | map | copy | partition | connect | cut) ?> <!ELEMENT contextRef EMPTY> <!ATTLIST contextRef location CDATA #REQUIRED> <!ELEMENT zero EMPTY> <!ELEMENT sequence ((silence | sink | source | task | call | return | release) *, (zero | switch | map | copy | partition | connect cut)?, contextRef?)> <!ELEMENT silence EMPTY> <!ELEMENT sink (portRef, messageRef, contextRef?)> <!ELEMENT source (portRef, messageRef, contextRef?)> <!ELEMENT task ((sink | source)*, contextRef?)> <!ATTLIST task choice (all | any) “all”) <!ELEMENT call (scheduleRef, portRef*, messageRef*, contextRef)> <!ELEMENT return (contextRef?)> <!ELEMENT release (contextRef?)> <!ELEMENT switch (branch* default? contextRef?)> <!ELEMENT branch (case, (zero | sequence | switch map | copy | partition | connect | cut), contextRef?)> <!ELEMENT case (ruleRef, messageRef, messageRef)> <!ELEMENT ruleRef EMPTY> <!ATTLIST ruleRef location CDATA #REQUIRED> <!ELEMENT default ((zero sequence | switch | map | copy partition | connect | cut), contextRef?)> <!ELEMENT map ((zero | sequence switch | copy | partition | connect | cut), assignmentList?, contextRef?)> <!ELEMENT assignmentList (assignment*)> <!ELEMENT assignment (messageRef, portRef)> <!ELEMENT copy ((zero | sequence switch | map | copy | partition | connect | cut), contextRef?)> <!ELEMENT partition ((zero sequence | switch | map copy | partition connect | cut) *, contextRef?)> <!ELEMENT connect ((zero | sequence | switch | map | copy partition connect | cut), (zero | sequence | switch | map | copy partition connect | cut), connectionList?, contextRef?)> <!ELEMENT connectionList (connection*)> <!ELEMENT connection (portRef, portRef)> <!ELEMENT cut ((zero | sequence | switch | map | copy | partition | connect | cut), (zero | sequence | switch | map | copy | partition connect | cut), (zero sequence | switch | map | copy | partition | connect | cut), contextRef?)> 

1. A computer implemented business system, comprising: a first subsystem to execute a first business transaction that is independent, the first subsystem operating according to a business process that utilizes a process algebra that includes two verbs, whose grammar is transformed from infix notation to prefix notation and operators of the process algebra are then assigned tags to form language constructs, first verb representing the independent transaction; a second subsystem operating according to the business process to execute a second business transaction that is interdependent, second verb representing the interdependent transaction; and at least one of the first and second business transactions includes one or more child transactions, failure of one of the one or more child transactions instigates compensation by the one or more child transactions, the failed one of the one or more child transactions and the at least one of the first and second business transactions that includes the one or more child transactions.
 2. The system of claim 1, the first and second business transactions each comprising one of a single action in a business operation, a single business operation, and a plurality of business operations of the business process.
 3. The system of claim 1, the first business transaction is separate from the second business transaction.
 4. The system of claim 1, the first business transaction and the second business transaction are executed concurrently on a single computer.
 5. The system of claim 1, the first business transaction and the second business transaction are each executed separately on different computers.
 6. The system of claim 1, the second business transaction including at least one interdependent child transaction, the interdependent business transaction committing only after the last interdependent child transaction commits.
 7. The system of claim 6, after the second business transaction commits, the second business transaction transmits data to the business process to perform one of allowing and denying the data.
 8. The system of claim 1, each of the first and second business transactions including at least one action, which actions execute concurrently according to concurrently executing the first and second business transactions.
 9. The system of claim 8, the first business transaction committing only after a final action completes execution.
 10. The system of claim 8, the second business transaction committing only after a final action completes execution.
 11. The system of claim 1, the one or more child transactions defined according to boundaries.
 12. The system of claim 1, if at least one of the first and second business transactions fails, compensation is invoked.
 13. A computer according to the system of claim
 1. 14. A computer-readable medium having computer-executable instructions stored thereon to execute the components of claim
 1. 15. A method of operating a computer implemented business system, comprising: executing separately first and second business transactions according to a business process that utilizes a process algebra that includes two verbs, wherein first verb represents the first business transaction which is an independent transactions and second verb represents the second business transaction which is an interdependent transactions, the process algebra including grammar that is transformed from infix notation to prefix notation and operators of the process algebra are then assigned tags to form language constructs; and the second business transaction includes one or more child transactions, failure of at least one of the one or more child transactions instigates compensation by calling a compensator from inside at least one of the one or more child transactions, outside the child transactions, a failed transaction, or from within a committed transaction.
 16. The method of claim 15, the first and second business transactions each comprising one of a single action in a business operation, a single business operation, and a plurality of business operations of the business process.
 17. The method of claim 15, further comprising operating the first and second business transactions according to at least one of sequentially and concurrently.
 18. The method of claim 15, the second business transaction is interdependent and explicitly separate from the first business transaction.
 19. The method of claim 15, further comprising executing concurrently on a single computer the first business transaction, which is an independent business transaction, and the second transaction, which is interdependent business transaction.
 20. The method of claim 15, further comprising executing the first business transaction at a location different from the second business transaction, each transaction executed relative to the other according to one of sequentially and concurrently.
 21. The method of claim 15, further comprising committing the second business transaction only after a last interdependent child transaction commits.
 22. The method of claim 15, further comprising committing the second business only after a last interdependent child transaction of a plurality of concurrently executing child interdependent transaction, commits.
 23. The method of claim 15, further comprising transmitting data to a business process to perform one of allowing and denying the data after the second business transaction commits.
 24. The method of claim 15, each of the first and second business transactions including at least one action, which action of the first business transaction executes concurrently with the action of the second business transaction.
 25. The method of claim 15, further comprising committing at least one of the first business transaction and the second business transaction only after a final action of the corresponding business transaction completes execution.
 26. The method of claim 15, further comprising explicitly defining a transaction boundary of one or more child transactions that are included in at least one of the first and second business transactions.
 27. The method of claim 15, further comprising invoking compensation if at least one of an action and transaction of the first or second business transactions fails.
 28. The method of claim 15, further comprising invoking compensation if at least one of an action and transaction of the first or second business transactions fails, which compensation includes compensating tasks for committed interdependent concurrent transactions, and all committed transactions and actions outside of the a parent transaction.
 29. A computer implemented business system, comprising: means for executing a first and a second business transactions, the business transaction operates according to a process algebra that includes two verbs, wherein a first verb represents the first business transaction which is an independent transaction and a second verb represents the second business transaction which is an interdependent transaction including a plurality of associated interdependent child transactions; means for transforming grammar of the process algebra from infix notation to prefix notation and assigning tags to the operators of the process algebra to form language constructs; means for determining if an internal transaction has completed; means for invoking a compensator from inside the completed internal transaction, each of the plurality of associated interdependent child transactions and the business transaction; and means for allowing or denying the business transaction based upon a completion of the internal transaction.
 30. The system of claim 29, the interdependent child transactions execute concurrently.
 31. The system of claim 30, the business transaction allowed or denied only after all of the interdependent child transactions have completed.
 32. The system of claim 30, the interdependent parent transaction committing only after the plurality of interdependent child transactions have completed.
 33. A memory storing data accessible by a computer implemented business system that utilizes a process algebra, comprising: a data structure stored in the memory, the data structure representative of the process algebra whose grammar has been transformed from infix notation to prefix notation and operators of the process algebra are then assigned tags to form language constructs, wherein the process algebra includes two verbs, the first verb representing an independent transaction and the second verb representing an interdependent transaction; a first element of the data structure representing a construct to distinguish between synchronization of autonomous concurrent operations from interdependent concurrent operations; a second element of the data structure representing a construct for interdependent operations; and an element that represents a construct for initiating compensation by the autonomous concurrent operations, the interdependent concurrent operations, one or more child interdependent concurrent operations and one or more committed operations.
 34. The memory of claim 33, further comprising an element for representing a construct for performing actions.
 35. The memory of claim 34, further comprising an element for representing messaging and an element for representing ports.
 36. The memory of claim 34, further comprising an element for representing a construct for grouping actions into concurrently executing actions.
 37. The memory of claim 34, further comprising an element for representing a construct for grouping actions into sequentially executing actions.
 38. The memory of claim 33, further comprising an element for representing a construct for providing context events.
 39. The memory of claim 33, further comprising a test element for representing a construct for providing test conditions.
 40. The memory of claim 33, further comprising an element for representing a construct for providing mapping.
 41. The memory of claim 33, further comprising an element for representing a construct for providing a call routine.
 42. The memory of claim 33, further comprising an element for representing a construct for providing branches in control flow.
 43. The memory of claim 33, further comprising an element for representing a construct for providing copies of new instances of processes.
 44. The memory of claim 33, the prefix notation further transformed into a set of tags. 